منابع مشابه
On the b-dominating coloring of graphs
The b-chromatic number (G) of a graphG is defined as the largest number k for which the vertices of G can be colored with k colors satisfying the following property: for each i, 1 i k, there exists a vertex xi of color i such that for all j = i, 1 j k there exists a vertex yj of color j adjacent to xi . A graph G is b-perfect if each induced subgraph H of G has (H) = (H), where (H) is the chrom...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملOn b-coloring of the Kneser graphs
A b-coloring of a graph G by k colors is a proper k-coloring of G such that in each color class there exists a vertex having neighbors in all the other k− 1 color classes. The b-chromatic number of a graph G, denoted by φ(G), is the maximum k for which G has a b-coloring by k colors. It is obvious that χ(G) ≤ φ(G). A graph G is b-continuous if for every k between χ(G) and φ(G) there is a b-colo...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملB-coloring of Tight Graphs
A coloring c of a graph G = (V,E) is a b-coloring if in every color class there is a vertex colored i whose neighborhood intersects every other color classes. The b-chromatic number of G, denoted χb(G), is the greatest integer k such that G admits a b-coloring with k colors. A graph G is tight if it has exactly m(G) vertices of degree m(G)−1, where m(G) is the largest integer m such that G has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.04.001